Using Spanning-Trees for Balancing Dynamic Load on Multiprocessors - Distributed Memory Computing Conference, 1991. Proceedings., The Sixth
نویسنده
چکیده
We consider the problem of load balancing t o minimize the cost of dynamic computations, including the cost of migrations. We analyze the costs associated with diffusion based algorithms for several common architectures. We introduce the Ripple load balancing paradigm, which has several advantages over diffusion methods, including flexibility and faster convergence.
منابع مشابه
Ecient Mesh Partitioning for Parallel P.d.e. Solvers on Distributed Memory Machines Extended Version of the Paper Which Appears in the Proceedings of the Sixth Siam Conference on Parallel Processing for Scientic Computing
When solving a partial dierential equation on a MIMD distributed memory computer there arises the problem of distributing the mesh so that the communication requirement of the numerical solver is minimised subject to a load balancing constraint. In this paper we introduce a new algorithm for this partitioning problem for unstructured meshes and study its properties, along with those of other co...
متن کاملLocality-Preserving Dynamic Load Balancing for Data-Parallel Applications on Distributed-Memory Multiprocessors
Load balancing and data locality are the two most important factors affecting the performance of parallel programs running on distributed-memory multiprocessors. A good balancing scheme should evenly distribute the workload among the available processors, and locate the tasks close to their data to reduce communication and idle time. In this paper, we study the load balancing problem of data-pa...
متن کاملLoad Balancing for Extraplation Methods on Distributed Memory Multiprocessors
We presents a parallel algorithm for extrapolation methods on distributed memory multiprocessors combining diierent levels of par-allelism. A detailed analysis that uses appropriate primitives for communication shows that a sophisticated load balancing scheme is required to achieve a good speedup. We characterize an optimal load balancing based on Lagrange multipliers and investigate several si...
متن کاملParallelizing Spatial Databases on Shared-Memory Multiprocessors
Several emerging visualization applications such as ight simulators, distributed interactive simulation (DIS), and virtual reality are using geographic information systems (GISs) for high-delity representation of actual terrains. These applications impose stringent performance and response-time restrictions which require parallelization of the GIS and shared-memory multiprocessors (SMPs) are we...
متن کاملLoad Balancing Unstructured Adaptive Grids for CFD Problems
Mesh adapt(on is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. A dynamic load balancing method is presented that balances the workload across all processors with a global view. After each parallel tetrahedral mesh adapt(on, the method first determines if the new mesh is sufficiently unbalanced to warrant a repartit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004